Multiplying huge integers using Fourier transforms
نویسنده
چکیده
Multiplying huge integers of n digits can be done in time O(n log(n)) using Fast Fourier Transforms (FFT), instead of the O(n) time complexity normally required. In this paper we present this technique from the viewpoint of polynomial multiplication, explaining a recursive divide-and-conquer approach to FFT multiplication. We have compared both methods of multiplication quantitatively and present our results and conclusions in this paper, along with complexity analyses and error bounds.
منابع مشابه
Measurement of Plain Weave Fabrics Density Using Fourier Transforms
Warp and weft spacing and its coefficient of variation affect the physical properties of fabrics such as fabric hand, frictional and mechanical properties. In this paper the weft and warp spacing and its coefficient of variation for plain weave is calculated using Fourier transforms. Different methods have been used in this work including autocorrelation function. First, two dimensional power s...
متن کاملDiscrete Weighted Transforms and Large-integer Arithmetic
It is well known that Discrete Fourier Transform (DFT) techniques may be used to multiply large integers. We introduce the concept of Discrete Weighted Transforms (DWTs) which, in certain situations, substantially improve the speed of multiplication by obviating costly zero-padding of digits. In particular, when arithmetic is to be performed modulo Fermât Numbers 22"1 + 1 , or Mersenne Numbers ...
متن کاملMeasurement of Plain Weave Fabrics Density Using Fourier Transforms
Warp and weft spacing and its coefficient of variation affect the physical properties of fabrics such as fabric hand, frictional and mechanical properties. In this paper the weft and warp spacing and its coefficient of variation for plain weave is calculated using Fourier transforms. Different methods have been used in this work including autocorrelation function. First, two dimensional power s...
متن کاملA Characterization of Fourier Transforms
The aim of this paper is to show that, in various situations, the only continuous linear map that transforms a convolution product into a pointwise product is a Fourier transform. We focus on the cyclic groups Z/nZ, the integers Z, the Torus T and the real line. We also ask a related question for the twisted convolution. In memory of A. Hulanicki.
متن کاملFourier Transforms of Finite Chirps
Chirps arise in many signal processing applications. While chirps have been extensively studied both as functions over the real line and the integers, less attention has been paid to the study of chirps over finite groups. We study the existence and properties of chirps over finite cyclic groups of integers. In particular, we introduce a new definition of a finite chirp which is slightly more g...
متن کامل